VTA* Algorithm: A* Path-Finding Algorithm using Variable Turn Heuristic
نویسندگان
چکیده
منابع مشابه
A Heuristic Homotopic Path Simplification Algorithm
We study the well-known problem of approximating a polygonal path P by a coarse one, whose vertices are a subset of the vertices of P . In this problem, for a given error, the goal is to find a path with the minimum number of vertices while preserving the homotopy in presence of a given set of extra points in the plane. We present a heuristic method for homotopy-preserving simplification under ...
متن کاملA Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...
متن کاملA More Eecient Path-finding Algorithm
In this paper, we present a new routing algorithm, which we call path-nding algorithm (PFA). It drastically reduces the possibility of temporary routing loops, which accounts for its fast convergence properties. Like other path-nding algorithms, PFA operates by specifying the second-to-last hop to each destination, in addition to the distance to the destination. A detailed proof of correctness ...
متن کاملA Path - Finding Algorithm for Loop - Free
| A loop-free path-nding algorithm (LPA) is presented ; this is the rst routing algorithm that eliminates the formation of temporary routing loops without the need for internodal synchronization spanning multiple hops or the speciication of complete or variable-size path information. Like other previous algorithms, LPA operates by specifying the second-to-last hop and distance to each destinati...
متن کاملA Loop - free Path - Finding Algorithm : Speci
The loop-free pathnding algorithm (LPA) is presented. LPA speci es the second-to-last hop and distance to each destination to ensure termination; in addition, it uses an inter-neighbor synchronization mechanism to eliminate temporary loops. A detailed proof of LPA's correctness is presented and its complexity is evaluated. LPA's average performance is compared by simulation with the performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korean Institute of Information and Communication Engineering
سال: 2010
ISSN: 2234-4772
DOI: 10.6109/jkiice.2010.14.3.663